Nondeterministic LTAG Derivation Tree Extraction
نویسنده
چکیده
In this paper we introduce a naive algorithm for nondeterminisctic LTAG derivation tree extraction from the Penn Treebank and the Proposition Bank. This algorithm is used in the EM models of LTAG Treebank Induction reported in (Shen and Joshi, 2004). Given the trees in the Penn Treebank with PropBank tags, this algorithm generates shared structures that allow efficient dynamic programming in the EM models.
منابع مشابه
Latent SVMs for Semantic Role Labeling using LTAG Derivation Trees∗
A phrase structure parse tree for a sentence can be generated by many different Lexicalized Tree-Adjoining Grammar (LTAG) derivation trees. In this paper, we use multiple LTAG derivations as latent features for semantic role labeling (SRL). We hypothesize that positive and negative examples of individual semantic roles can be reliably distinguished by possibly different latent LTAG-based featur...
متن کاملLTAG Semantics with Semantic Unification
This paper sets up a framework for LTAG (Lexicalized Tree Adjoining Grammar) semantics that brings together ideas from different recent approaches addressing some shortcomings of TAG semantics based on the derivation tree. Within this framework, several sample analyses are proposed, and it is shown that the framework allows to analyze data that have been claimed to be problematic for derivation...
متن کاملGlueTag Linear Logic based Semantics for LTAG
We review existing appoaches to semantics construction in LTAG (Lexicalised Tree Adjoining Grammar) based on the notion of derivation (tree)s. We argue that derivation structures in LTAG are not appropriate to guide semantic composition, due to a non-isomorphism, in LTAG, between the syntactic operation of adjunction on the one hand, and the semantic operations of complementation and modificati...
متن کاملGlueTag Linear Logic based Semantics Construction for LTAG
In this paper we review existing appoaches to semantics construction in LTAG (Lexicalised Tree Adjoining Grammar) which are all based on the notion of derivation (tree)s. We argue that derivation structures in LTAG are not appropriate to guide semantic composition, due to a non-isomorphism, in LTAG, between the syntactic operation of adjunction on the one hand, and the semantic operations of co...
متن کاملUDRT-based Semantics Construction for LTAG
Lexicalized Tree Adjoining Grammars (LTAGs) [6] are tree rewriting systems consisting of a finite set of trees associated with lexical items, so-called elementary trees (etrees). Elementary trees represent extended projections of lexical items that encapsulate all their syntactic/semantic arguments. Due to this property, semantics construction in LTAG can be based on elementary trees as basic u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004